全文获取类型
收费全文 | 601篇 |
免费 | 48篇 |
国内免费 | 52篇 |
专业分类
化学 | 9篇 |
晶体学 | 2篇 |
力学 | 34篇 |
综合类 | 25篇 |
数学 | 587篇 |
物理学 | 44篇 |
出版年
2024年 | 1篇 |
2023年 | 7篇 |
2022年 | 12篇 |
2021年 | 17篇 |
2020年 | 21篇 |
2019年 | 32篇 |
2018年 | 26篇 |
2017年 | 22篇 |
2016年 | 15篇 |
2015年 | 22篇 |
2014年 | 19篇 |
2013年 | 50篇 |
2012年 | 24篇 |
2011年 | 30篇 |
2010年 | 23篇 |
2009年 | 40篇 |
2008年 | 52篇 |
2007年 | 33篇 |
2006年 | 49篇 |
2005年 | 24篇 |
2004年 | 17篇 |
2003年 | 26篇 |
2002年 | 28篇 |
2001年 | 18篇 |
2000年 | 16篇 |
1999年 | 12篇 |
1998年 | 12篇 |
1997年 | 8篇 |
1996年 | 8篇 |
1995年 | 8篇 |
1994年 | 7篇 |
1993年 | 3篇 |
1992年 | 1篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 6篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1981年 | 1篇 |
1979年 | 1篇 |
1978年 | 1篇 |
1959年 | 1篇 |
排序方式: 共有701条查询结果,搜索用时 281 毫秒
1.
2.
A new family of proximity graphs: Class cover catch digraphs 总被引:1,自引:0,他引:1
Jason DeVinney 《Discrete Applied Mathematics》2006,154(14):1975-1982
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given. 相似文献
3.
A (w,r) cover‐free family is a family of subsets of a finite set such that no intersection of w members of the family is covered by a union of r others. A (w,r) superimposed code is the incidence matrix of such a family. Such a family also arises in cryptography as the concept of key distribution pattern. In the present paper, we give some new results on superimposed codes. First we construct superimposed codes from super‐simple designs which give us results better than superimposed codes constructed by other known methods. Next we prove the uniqueness of the (1,2) superimposed code of size 9 × 12, the (2,2) superimposed code of size 14 × 8, and the (2,3) superimposed code of size 30 × 10. Finally, we improve numerical values of upper bounds for the asymptotic rate of some (w,r) superimposed codes. © 2004 Wiley Periodicals, Inc. 相似文献
4.
Xuding Zhu 《Journal of Graph Theory》2005,48(3):186-209
For 1 ≤ d ≤ k, let Kk/d be the graph with vertices 0, 1, …, k ? 1, in which i ~j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χc(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to Kk/d. The circular clique number ωc(G) of G is the maximum of those k/d for which Kk/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χc(H) = ωc(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, NG[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, NG[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P5 (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph Kk/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005 相似文献
5.
We prove that, for any given vertex ν* in a series-parallel graph G, its edge set can be partitioned into κ = min{κ′(G) + 1, δ(G)} subsets such that each subset covers all the vertices of G possibly except for ν*, where δ(G) is the minimum degree of G and κ′(G) is the edge-connectivity of G. In addition, we show that the results in this paper are best possible and a polynomial time algorithm can be obtained for
actually finding such a partition by our proof. 相似文献
6.
In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics. 相似文献
7.
On the basis of the hydrodynamic equations for nonlinear elastic-gravity waves beneath a solid ice cover and their Hamiltonian representation, a three-wave kinetic equation for the time evolution of the wave spectrum is formulated. The properties of the kernel of the kinetic integral describing the nonlinear interactions between wave triplets are investigated. An algorithm for numerically calculating the kinetic integral is developed. The rate of nonlinear energy transfer over the wave spectrum is estimated quantitatively and its most important characteristics are found. 相似文献
8.
We address in this paper the problem of finding an optimal strategy for dealing with bottleneck machines and bottleneck parts in the cell formation process in group technology. Three types of economic decisions are considered: subcontracting, machine duplication and intercell moves. The problem is formulated as a minimum weighted node covering problem in a hypergraph, and we show that it can be solved in polynomial time by finding a maximum weighted stable set in a bipartite graph. We extend this result to cellular manufacturing systems in which the sequence of operations of each part is known in advance. 相似文献
9.
The generalized Mycielskians (also known as cones over graphs) are the natural generalization of the Mycielski graphs (which were first introduced by Mycielski in 1955). Given a graph G and any integer m?0, one can transform G into a new graph μm(G), the generalized Mycielskian of G. This paper investigates circular clique number, total domination number, open packing number, fractional open packing number, vertex cover number, determinant, spectrum, and biclique partition number of μm(G). 相似文献
10.
关于Ramsey数下界的部分结果 总被引:3,自引:1,他引:2
刘富贵 《数学的实践与认识》2002,32(1):97-99
本文得到 Ramsey数下界的一个计算公式 :R( l,s+ t-2 )≥ R( l,s) + R( l,t) -1 ,(式中 l、s、t≥ 3) .用此公式算得的 Ramsey数的下界比用其它公式算得的下界好 . 相似文献